|
In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of discrete orthogonal polynomials used in approximation theory, introduced by and rediscovered by . ==Definition== The polynomials are defined as follows: Let ''f'' be a smooth function defined on the closed interval (), whose values are known explicitly only at points ''x''''k'' := −1 + (2''k'' − 1)/''m,'' where ''k'' and ''m'' are integers and 1 ≤ ''k'' ≤ ''m''. The task is to approximate ''f'' as a polynomial of degree ''n'' < ''m''. Consider a positive semi-definite bilinear form : where ''g'' and ''h'' are continuous on () and let : be a discrete semi-norm. Let φ''k'' be a family of polynomials orthogonal to each other : whenever i is not equal to k. Assume all the polynomials φ''k'' have a positive leading coefficient and they are normalized in such a way that : The φ''k'' are called discrete Chebyshev (or Gram) polynomials. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Discrete Chebyshev polynomials」の詳細全文を読む スポンサード リンク
|